On univalence and P-matrices

AbstractSuppose F is a differentiable mapping from a rectangle R⊂En into En. Gale and Nikaido proved that if the Jacobian of F is a P-matrix in R, then F is univalent in R. Their paper has served as the basis of numerous results on univalence. Recently H. Scarf conjectured a significant extension: that the Jacobian of F need not be a P-matrix everywhere in the rectangle R, but merely on its boundary. This paper proves Scarf's conjecture, and to do so utilizes a conceptually different method of proof than that of Gale and Nikaido. The proof is presented in such a way as to demonstrate a suggestion of Scarf that orientation arguments may provide an alternative proof of the Gale-Nikaido theorem

A computational analysis of lower bounds for big bucket production planning problems

In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provide crucial insights on why these problems are hard to solve, and this is addressed by a thorough analysis in the paper. We conclude with computational results on a variety of widely used test sets, and a discussion of future research

Generic properties of the complementarity problem

Given f : R + n → R n , the complementarity problem is to find a solution to x ≥ 0, f(x) ≥ 0, and 〈 x, f(x) 〉 = 0. Under the condition that f is continuously differentiable, we prove that for a generic set of such an f , the problem has a discrete solution set. Also, under a set of generic nondegeneracy conditions and a condition that implies existence, we prove that the problem has an odd number of solutions.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47915/1/10107_2005_Article_BF01584674.pd